Robust Stabilizing Leader Election
نویسندگان
چکیده
In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustnessis the aptitude of an algorithm to withstand permanent failures such as process crashes. The stabilization is a generaltechnique to design algorithms tolerating transient failures. Using these two approaches, we propose algorithms thattolerate both transient and crash failures. We study two notions of stabilization: the selfand the pseudostabilization(pseudo-stabilization is weaker than self-stabilization). We focus on the leader election problem. The goal here is toshow the implementability of the robust selfand/or pseudostabilizing leader election in various systems with weakreliability and synchrony assumptions. We try to propose, when it is possible, communication-efficient implementations.In this work, we exhibit some assumptions required to obtain robust stabilizing leader election algorithms. Our resultsshow, in particular, that the gap between robustness and stabilizing robustness is not really significant when we considerfix-point problems such as leader election.
منابع مشابه
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملStabilizing token schemes for population protocols
In this paper we address the stabilizing token circulation and leader election problems in population protocols model augmented with oracles. Population protocols is a recent model of computation that captures the interactions of biological systems. In this model emergent global behavior is observed while anonymous finite-state agents(nodes) perform local peer interactions. Uniform self-stabili...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کاملA Self-Stabilizing Leader Election Algorithm for Tree Graphs
We propose a self stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
متن کامل